نتایج جستجو برای: window
تعداد نتایج: 62715 فیلتر نتایج به سال:
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
This study investigated whether information retrieval can be improved if documents are divided into smaller subdocuments or passages, and the retrieval score for these passages are incorporated in the final retrieval score for the whole document. The documents were segmented by sliding a window of a certain size across the document. Each time the window stopped, it displayed/extracted a certain...
Background and aims: Today job stress is one of the most important problems of staffs that has physical and mental impact on them and also reduces their efficiency; therefore, it can affect organizations’ productivity and economy. Besides, regarding offices around the world and their improvements in 20th century comparing to offices in Iran, shows that we need to research and change Irani...
In this article, stream flow effectivness is based on hydraulic network studied in the shell-side of a shell and tube heat exchange as a case study. For an appropriate heat exchangers rating design to meet a specified duty, it's better to consider each stream flow separately. Using the hydraulic network principals, a set of the correlations for calculating different stream flow rates in the cro...
It is a demanding and time-consuming task to construct the side window mechanism of a car such that the deflections along the seals are minimized. The reason for this is that the window surface S delivered by the stylist, will in general not be movable in a proper way: It is required that the surface tightly moves along the seals. Deflections will necessarily occur no matter how much effort the...
Existing digital logic simulators typically depend on a discrete-time model of circuit behaviour. Whilst this approach is sufficient in many cases for the validation of the behaviour of synchronous circuits, it is not good at identifying glitches that are narrower than the available time resolution. Moreover, it is not generally feasible to accommodate uncertainty in delay time in such a way as...
Moving window concepts are used in temporal query languages for aggregate functions over the dimension ‘time’. In the medical domain, aggregation of patient data over time windows builds a powerful mechanism within clinical database queries to satisfy a class of typical medical question formulations. In opposite to other fields, like the business domain for example, there is the additional need...
This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are typically seen in robotics and control applications. This paper also discusses the relaxation of TWTL formulae with respect to deadlines of tasks. Eff...
This paper introduces a family of tetravalent graphs called rose window graphs, denoted by Rn(a, r), and investigates their symmetry properties. Four families of these graphs are shown to be edge-transitive and it is conjectured that every Rn(a, r) which is edge-transitive belongs to one of these families. Proofs and conjectures about the size of a dart-stabilizer and about regular maps contain...
A major goal of axion searches is to reach inside the parameter space region of realistic axion models. Currently, the boundaries of this region depend on somewhat arbitrary criteria, and it would be desirable to specify them in terms of precise phenomenological requirements. We consider hadronic axion models and classify the representations R_{Q} of the new heavy quarks Q. By requiring that (i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید