نتایج جستجو برای: cut method eventually
تعداد نتایج: 1731426 فیلتر نتایج به سال:
چکیده ندارد.
In this paper we conjecture that the piecewise linear map f(x) = px1I[0,1/p)(x)+ (sx − s/p)1I[1/p,1](x), p > 1, 0 < s < 1 which has an expanding, onto branch and a contracting branch is eventually piecewise expanding. We give a partial proof of the conjecture, in particular for values of p and s such that d− ln(p(1−s)+s) ln s e 6 = d− ln p ln s e.
This paper continues the work of our previous papers, The cyclic spectrum of a Boolean flow TAC 10 392-419 and Spectra of finitely generated Boolean flows TAC 16 434459. We define eventually cyclic Boolean flows and the eventually cyclic spectrum of a Boolean flow. We show that this spectrum, as well as the spectra defined in our earlier papers, extend to parametrized flows on Stone spaces and ...
Many distributed services are hosted at large, shared, geographically diverse data centers, and they use replication to achieve high availability despite the failure of an entire data center. Recent events show that non-crash faults occur in these services and may lead to long outages. While Byzantine Fault Tolerance (BFT) could be used to withstand these faults, current BFT protocols can becom...
in this paper, a new guidance method for surface to surface ballistic missiles without mandatory engine cut-off will be presented. the complexity of solid fuel engine cut-off demands a comprehensive method for guiding these missiles. in the method presented in this paper, a certain guidance law is applied such that by transmitting appropriate commands to the control system, by changing the miss...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید