922 resultados para LIFSHITZ POINTS
Resumo:
This Article does not have an abstract.
Resumo:
The use of fixation points (FPs) in visual psychophysics is common practice, though the costs and benefits of different fixation regimens have not been compared. Here we investigate the influence of several different types of FP configurations on the contrast detection of patches of sine-wave gratings. We find that for small targets (1°), the addition of a superimposed central FP can increase thresholds by a factor of 1.3 (2.5 dB) in comparison with no FP, and a factor of 1.5 (3.6 dB) in comparison with FPs that surround the target. These results are consistent with (i) a suppressive influence on the central region of the target from a central FP, and (ii) facilitatory influences from surrounding FPs. Our analysis of the slope of the psychometric function suggests that the facilitatory influence is not due to reduction of uncertainty. Plausible candidate causes for the facilitation are: (i) sensory interactions, (ii) aids to ocular accommodation and convergence, (iii) a reduction in eye-movements and (iv) more accurate placement of the observer’s window of attention. Masking by a central FP is not found for the suprathreshold task of contrast discrimination, suggesting that the masking effects of pedestal and FP do not combine linearly. This means that estimates of the level of masking produced by a contrast pedestal can depend on the details of the fixation point.
Resumo:
In this paper, we demonstrate the possibility of reaching a quasi-stable nonlinear transmission regime with carrier pulses of 12.5 ps width in multi-channel 40 Gbit/s systems. The quasi-stable pulses that are presented in this work for the first time are not dispersion-managed solitons, and are indeed supported by a large normal span average dispersion and misbalanced optical amplification, and representing a new type of nonlinear carrier.
Resumo:
The general ordinary quasi-differential expression M of n-th order with complex coefficients and its formal adjoint M + are considered over a regoin (a, b) on the real line, −∞ ≤ a < b ≤ ∞, on which the operator may have a finite number of singular points. By considering M over various subintervals on which singularities occur only at the ends, restrictions of the maximal operator generated by M in L2|w (a, b) which are regularly solvable with respect to the minimal operators T0 (M ) and T0 (M + ). In addition to direct sums of regularly solvable operators defined on the separate subintervals, there are other regularly solvable restrications of the maximal operator which involve linking the various intervals together in interface like style.
Resumo:
∗ This research is partially supported by the Bulgarian National Science Fund under contract MM-403/9
Resumo:
The problem of transit points arrangement is presented in the paper. This issue is connected with accuracy of tariff distance calculation and it is the urgent problem at present. Was showed that standard method of tariff distance discovering is not optimal. The Genetic Algorithms are used in optimization problem resolution. The UML application class diagram and class content are showed. In the end the example of transit points arrangement is represented.
Resumo:
The subject of collinearity of 3 points on a line is challenging for 7th- grade students. This article discusses the possibilities to demonstrate different approaches for solving collinearity of three points on a line: straight angle, axiom on the uniform mapping of an angle on a half-plane, parallel axiom, vector method, and homothetic features. The experiment was held using GEONExT to demonstrate by visual methods collinearity of three points on a line a district type of problems.
Resumo:
It is shown in the paper the discovery of two remarkable points of the triangle by means of “THE GEOMETER’S SKETCHPAD” software. Some properties of the points are considered too.
Resumo:
In this work we give su±cient conditions for k-th approximations of the polynomial roots of f(x) when the Maehly{Aberth{Ehrlich, Werner-Borsch-Supan, Tanabe, Improved Borsch-Supan iteration methods fail on the next step. For these methods all non-attractive sets are found. This is a subsequent improvement of previously developed techniques and known facts. The users of these methods can use the results presented here for software implementation in Distributed Applications and Simulation Environ- ments. Numerical examples with graphics are shown.
Resumo:
2000 Mathematics Subject Classification: Primary 14H55; Secondary 14H30, 14H40, 20M14.
Resumo:
2000 Mathematics Subject Classification: 14D20, 14J60.