We studied the detection of chromoluminance patterns in the presence of chromoluminance pedestals. We examined how thresholds depend on the color directions of the target and the pedestal. Both targets and pedestals were spatial Gabor patterns (horizontal, 1 cpd) .The patterns were spatially modulated in color, luminance or both. Equidiscrimination contours describe contrast thresholds for targ...

This note proposes a new get-rich-quick scheme that involves trading in a stock with a continuous but not constant price path. The existence of such a scheme, whose practical value is tempered by its use of the Axiom of Choice, shows that imposing regularity conditions (such as measurability) is essential even in the foundations of game-theoretic probability. . . . these results do not give a p...

Training agents in a virtual crowd to achieve a task can be accomplished by allowing the agents to learn by trial-and-error and by sharing information with other agents. Since sharing enables agents to potentially reach optimal behavior more quickly, what type of sharing is best to use to achieve the quickest learning times? This paper categorizes sharing into three categories: realistic, unrea...

It is demonstrated that unique and simple analytical functions are justified for the atomic charge dependences q of the T (T = Al, P) and O atoms of aluminophosphates (AlPOs) using DFT calculations with several basis sets, starting from STO-3G to 3-21G and 6-21G**. Three internal (bonds, angles, ...) coordinates for the charge dependences of the T atoms and four coordinates for the O are suffic...

ABSTRACT A program is developed that includes two hydrodynamic models, a 2D depth-averaged (2DH) and a Quasi-3D (Q3D), and a pollutant transport model that uses a 1 order upwinding and a 3 order QUICKEST numerical schemes. Several tests were performed in two test basins in order to examine the performance of the above models. The Q3D model is successfully applied to Lake Ontario, using a 4-km-s...

In a dynamic network, the quickest path problem asks for a path minimizing the time needed to send a given amount of flow from source to sink along this path. In practical settings, for example in evacuation or transportation planning, the reliability of network arcs depends on the specific scenario of interest. In this circumstance, the question of finding a quickest path among all those havin...

Given a network with capacities and transit times on the arcs, the quickest flow problem asks for a “flow over time” that satisfies given demands within minimal time. In the setting of flows over time, flow on arcs may vary over time and the transit time of an arc is the time it takes for flow to travel through this arc. In most real-world applications (such as, e.g., road traffic, communicatio...

The problem can be formulated in a number of equivalent different settings: in 7 terms of the topology and the geometry of hyperbolic three-manifolds, in purely alge8 braic terms, or in a combination of these. Since each of these use terminology that has 9 whose exact meaning has evolved over time, we survey some of the basic terminology 10 for Schottky groups, non-separating disjoint circle gr...