نتایج جستجو برای: early abort technique
تعداد نتایج: 1270850 فیلتر نتایج به سال:
New commercial crew vehicles require an emergency detection system for crew abort capability. This system is implemented to provide protection for the crew in the event that a catastrophic hazard occurs. The emergency detection system developed for the Atlas V is not unprecedented. The Space Shuttle program had several abort capabilities, as did the Apollo/Saturn vehicle. The underlying princip...
The Thomsen-Friedenreich antigen (TF), or more precisely epitope, has been known as a pancarcinoma antigen. It consists of galactose-beta1-3-N-acetylgalactose. We have already described the expression of TF in the normal placenta. TF is expressed by the syncytium and by extravillous trophoblast cells. In this study, we investigated the expression of TF in the abort placenta. Frozen samples of h...
A simple classification of products of conception aborted in early pregnancy is described. This classification bears a closer relation to the aetiology of the abortions and the timing of the teratological insult in those conceptuses with morphological abnormalities than have previous classifications. It is hoped it may be of value in counselling patients who abort recurrently and also in the as...
The quadratic sieve algorithm was used to factor a 47-digit number into primes. A comparison with Wagstaff's results using the continued fraction early abort algorithm suggests that QS should be faster than CFEA when the number being factored exceeds 60 digits (plus or minus ten or more digits, depending on details of the hardware and software).
We present a new client cache consistency algorithm for client caching database management systems. The algorithm, called Asynchronous Avoidance-based Cache Consistency (AACC), provides both good performance as well as a low abort rate. We present simulation results that compare AACC with two leading cache consistency algorithms: Adaptive Callback Locking (ACBL) and Adaptive Optimistic Concurre...
Recent work introduced the cube-and-conquer technique to solve hard SAT instances. It partitions the search space into cubes using a lookahead solver. Each cube is tackled by a conflict-driven clause learning (CDCL) solver. Crucial for strong performance is the cutoff heuristic that decides when to switch from lookahead to CDCL. Yet, this offline heuristic is far from ideal. In this paper, we p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید