Principles of designing ophthalmological devices to test operator activity

1983 ◽  
Vol 17 (3) ◽  
pp. 76-79
Author(s):  
E. P. Popechitelev ◽  
Z. M. Yuldashev
Keyword(s):  
Test Operator ◽  
Operator Activity

scholarly journals METHODOLOGY FOR FORMING AND IMPLEMENTING A TOUR AND DETERMINING ITS ECONOMIC EFFICIENCY

2021 ◽  
Author(s):  
Tetiana Krasnoded ◽  
Tetiana Bakina ◽  
Olena Zakharchenko
Keyword(s):  
Economic Efficiency ◽  
Tourist Destination ◽  
Main Component ◽  
Almost All ◽  
The Cost ◽  
Operator Activity ◽  
Tour Operator

The relevance of the study of issues in the context of tour operator activity is determined. Important issues of formation and promotion of the tour as the main component of tourist products are considered. A tour project is presented and an algorithm for creating a tourist product for several days for a specific tourist destination is demonstrated. The mechanism for determining the cost of a tour is revealed, which includes the cost of accommodation, meals, travel, excursion services and entertainment, support, insurance and other additional services provided to consumer tourists within the framework of a tourist project. At the same time, a mechanism for calculating individual elements of the tour price is presented. The method of calculating the company's profit and economic efficiency from the sale of the tour is revealed. General marketing directions in tourism are also proposed, which can be used to determine the preferences of tourists, present and promote almost all tourist products.

FINANCIAL SECURITY OF TOUR OPERATOR ACTIVITY IN RUSSIA

2017 ◽  
Vol 12 (3) ◽  
pp. 58-66 ◽  
Author(s):  
E. V. Zobova ◽  
◽  
L. A. Yakovleva ◽  
Yu. Yu. Kosenkova ◽  
◽  
...  
Keyword(s):  
Financial Security ◽  
Operator Activity ◽  
Tour Operator

A Method to Analyze Operator Activity

1997 ◽  
Vol 30 (18) ◽  
pp. 1273-1278
Author(s):  
Takashi Hamaguchi ◽  
Yoshihiro Hashimoto ◽  
Yoshitaka Togari
Keyword(s):  
Operator Activity

A Theory of Conditional Assertion

2019 ◽  
Vol 116 (6) ◽  
pp. 293-318
Author(s):  
Simon Goldstein ◽  
Keyword(s):  
Speech Act ◽  
Indicative Conditional ◽  
New Family ◽  
Traditional Test ◽  
Formal Framework ◽  
Test Operator ◽  
Truth Conditional ◽  
Truth Value ◽  
Conditional Assertion

According to one tradition, uttering an indicative conditional involves performing a special sort of speech act: a conditional assertion. We introduce a formal framework that models this speech act. Using this framework, we show that any theory of conditional assertion validates several inferences in the logic of conditionals, including the False Antecedent inference (that not A implies if A, then C). Next, we determine the space of truth-conditional semantics for conditionals consistent with conditional assertion. The truth value of any such conditional is settled whenever the antecedent is false, and whenever the antecedent is true and the consequent is false. Then, we consider the space of dynamic meanings consistent with the theory of conditional assertion. We develop a new family of dynamic conditional-assertion operators that combine a traditional test operator with an update operation.

2-Exp Time lower bounds for propositional dynamic logics with intersection

2005 ◽  
Vol 70 (4) ◽  
pp. 1072-1086 ◽  
Author(s):  
Martin Lange ◽  
Carsten Lutz
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Open Problem ◽  
Dynamic Logic ◽  
Propositional Dynamic Logic ◽  
Tree Structures ◽  
Exponential Time ◽  
Double Exponential ◽  
Test Operator ◽  
Dynamic Logics

AbstractIn 1984. Danecki proved that satisfiability in IPDL, i.e., Propositional Dynamic Logic (PDL) extended with an intersection operator on programs, is decidabie in deterministic double exponential time. Since then, the exact complexity of IPDL has remained an open problem: the best known lower bound was the ExpTime one stemming from plain PDL until, in 2004. the first author established ExpSpace-hardness. In this paper, we finally close the gap and prove that IPDL is hard for 2-ExpTime. thus 2-ExpTime-complete. We then sharpen our lower bound, showing that it even applies to IPDL without the test operator interpreted on tree structures.

Sign in / Sign up

Export Citation Format

Share Document