Backwards Runs the Reaction

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surfing the Web Backwards

From a user’s perspective, hypertext links on the web form a directed graph between distinct information sources. We investigate the effects of discovering “backlinks” from web resources, namely links pointing to the resource. We describe tools for backlink navigation on both the client and server side, using an applet for the client and a module for the Apache web server. We also discuss possi...

متن کامل

Backwards Analysis

Consider the following scheme to solve the sorting problem: given n numbers to be sorted, after the ith of n (1 ≤ i ≤ n), we will make sure that we have i of input numbers in a sorted list. Clearly these i sorted numbers will partition the ranks of the remaining n− i unsorted numbers into i + 1 intervals. The (i + 1)th step consists of choosing one of the n − i unsorted numbers uniformly at ran...

متن کامل

Pulling backwards

extinguished by the transfer. But the extent of the transformation is not yet clear. “It’s possible that what we are doing is turning everything into an oocyte,” says Gurdon. But he believes that oct4 expression is a good sign that the cells are at least headed toward becoming stem cells. Stem cell characteristics may develop only through sequential inductive events. But the optimists are hopin...

متن کامل

Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs

Iterative algorithms based on runs and runs of runs are presented to calculate the cells of the two–dimensional lattice intersected by a line of real slope and intercept. The technique is applied to the problem of traversing a ray through a two–dimensional grid. Using runs or runs of runs provides a significant improvement in the efficiency of ray traversal for all but very short path lengths w...

متن کامل

The Entropy of Backwards Analysis

Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation, e.g., incremental Delauney triangulation of a pointset, where points are added one by one, and where we always maintain the Delauney triangulation of the points...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mechanical Engineering

سال: 2008

ISSN: 0025-6501,1943-5649

DOI: 10.1115/1.2008-apr-3