Results 1  10
of
364,635
Odd Components of CoTrees and Graph Embeddings 1
"... Abstract: In this paper we investigate the relation between odd components of cotrees and graph embeddings. We show that any graph G must share one of the following two conditions: (a) for each integer h such that G may be embedded on Sh, the sphere with h handles, there is a spanning tree T in G s ..."
Abstract
 Add to MetaCart
Abstract: In this paper we investigate the relation between odd components of cotrees and graph embeddings. We show that any graph G must share one of the following two conditions: (a) for each integer h such that G may be embedded on Sh, the sphere with h handles, there is a spanning tree T in G
NEW UNITARY PERFECT NUMBERS HAVE AT LEAST NINE ODD COMPONENTS
, 1986
"... We say that a divisor d of an integer n is a unitary divisor if gcd(J, n/d) = 1, in which case we write d\n. By a component of an integer we mean a prime power unitary divisor. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We say that a divisor d of an integer n is a unitary divisor if gcd(J, n/d) = 1, in which case we write d\n. By a component of an integer we mean a prime power unitary divisor.
1 Effects of TimeOdd Components in Mean Field on Large Amplitude Collective Dynamics
"... We apply the adiabatic selfconsistent collective coordinate (ASCC) method to the multiO(4) model and study collective mass (inertia function) of the manybody tunneling motion. Comparing results with those of the exact diagonalization, we show that the ASCC method succeeds in describing gradual ch ..."
Abstract
 Add to MetaCart
change of excitation spectra from an anharmonic vibration about the spherical shape to a doublet pattern associated with a deformed doublewell potential possessing the oblateprolate symmetry. The collective mass is significantly increased by the quadrupolepairing contribution to timeodd components
On the Largest Odd Component of a Unitary Perfect Number." Fibonacci Quarterly 25.4
"... A divisor d of an integer n is a unitary divisor if gcd (d9 n/d) = 1. If d is a unitary divisor of n we write d\\n9 a natural extension of the customary notation for the case in which d is a prime power. Let o * (n) denote the sum of the unitary divisors of n: ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A divisor d of an integer n is a unitary divisor if gcd (d9 n/d) = 1. If d is a unitary divisor of n we write d\\n9 a natural extension of the customary notation for the case in which d is a prime power. Let o * (n) denote the sum of the unitary divisors of n:
Sustained and transient components of focal visual attention
 Vision Research
, 1989
"... AbstractHuman observers fixated the center of a search array and were required to discriminate the color of an odd target if it was present. The array consisted of horizontal or vertical black or white bars. In the simple case, only orientation was necessary to define the odd target, whereas in the ..."
Abstract

Cited by 261 (2 self)
 Add to MetaCart
AbstractHuman observers fixated the center of a search array and were required to discriminate the color of an odd target if it was present. The array consisted of horizontal or vertical black or white bars. In the simple case, only orientation was necessary to define the odd target, whereas
Analysis of odd/odd vertex
"... We analyze the Odd/odd vertex removal game introduced by P. Ottaway. We prove that every bipartite graph has Grundy value 0 or 1 only depending on the parity of the number of edges in the graph, which is a generalization of a conjecture of K. Shelton. We also answer a question originally posed by bo ..."
Abstract
 Add to MetaCart
We analyze the Odd/odd vertex removal game introduced by P. Ottaway. We prove that every bipartite graph has Grundy value 0 or 1 only depending on the parity of the number of edges in the graph, which is a generalization of a conjecture of K. Shelton. We also answer a question originally posed
Population Odds, Fitted Odds
"... This project involves the development of an interactive graphing tool to aid lenders in the credit scoring process. Credit scoring is a system in which lenders assess the risk of individual credit applicants to determine whether or not to grant them credit. Our client, Fair, Isaac & Company (FIC ..."
Abstract
 Add to MetaCart
This project involves the development of an interactive graphing tool to aid lenders in the credit scoring process. Credit scoring is a system in which lenders assess the risk of individual credit applicants to determine whether or not to grant them credit. Our client, Fair, Isaac & Company (FICO), is the world’s leading credit scoring consulting company. They aid in evaluating the current credit lending strategies for several financial institutions. These institutions constantly face tradeoffs such as maximizing profit while still maintaining a competitive market share when determining the optimal cutoff score. A cutoff score is represented by a specific credit score number in which all applicants above this number are accepted and applicants that fall below are denied. Our Capstone team designed a software package to help FICO visualize these tradeoffs incurred when managing credit portfolios. We developed an interactive tool to display the possible risks and/or benefits associated with credit portfolios.
Odd Viscosity
, 2008
"... When time reversal is broken the viscosity tensor can have a non vanishing odd part. In two dimensions, and only then, such odd viscosity is compatible with isotropy. Allowing for odd viscosity leads to a generalization of the wave and NavierStokes equations. Elementary features of odd viscosity ar ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
When time reversal is broken the viscosity tensor can have a non vanishing odd part. In two dimensions, and only then, such odd viscosity is compatible with isotropy. Allowing for odd viscosity leads to a generalization of the wave and NavierStokes equations. Elementary features of odd viscosity
Results 1  10
of
364,635