enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. R-factor (crystallography) - Wikipedia

    en.wikipedia.org/wiki/R-factor_(crystallography)

    Small molecules (up to ca. 1000 atoms) usually form better-ordered crystals than large molecules, and thus it is possible to attain lower R-factors. In the Cambridge Structural Database of small-molecule structures, more than 95% of the 500,000+ crystals have an R-factor lower than 0.15, and 9.5% have an R-factor lower than 0.03.

  3. Carrier-sense multiple access - Wikipedia

    en.wikipedia.org/wiki/Carrier-sense_multiple_access

    P-persistent This approach lies between the 1-persistent and non-persistent CSMA access modes. [1] When the transmitting node is ready to transmit data, it senses the transmission medium for idle or busy. If idle, then it transmits immediately. If busy, then it senses the transmission medium continuously until it becomes idle, then transmits ...

  4. Persistent data structure - Wikipedia

    en.wikipedia.org/wiki/Persistent_data_structure

    Perhaps the simplest persistent data structure is the singly linked list or cons-based list, a simple list of objects formed by each carrying a reference to the next in the list. This is persistent because the tail of the list can be taken, meaning the last k items for some k, and new nodes can be added in front of it. The tail will not be ...

  5. Persistent memory - Wikipedia

    en.wikipedia.org/wiki/Persistent_memory

    The read-of-non-persistent-write problem is found for lock-free programs on persistent memory. As compare-and-swap (CAS) operations do not persist the written values to persistent memory, the modified data can be made visible by the cache coherence protocol to a concurrent observer before the modified data can be observed by a crash observer at persistent memory.

  6. Persistent array - Wikipedia

    en.wikipedia.org/wiki/Persistent_array

    Theorem [1]: 67–69 — Consider a partially persistent array with elements and = modifications, where is a constant fulfilling <. Assuming the space complexity of the array is O ( m log k ⁡ m ) {\displaystyle O(m\log ^{k}m)} for a constant k {\displaystyle k} , the lower bound on the lookup complexity in this partially persistent array is ...

  7. Persistent data - Wikipedia

    en.wikipedia.org/wiki/Persistent_data

    Persistent data in the field of data processing denotes information that is infrequently accessed and unlikely to be modified. [1] Static data is information, for example a record, that does not change and may be intended to be permanent. It may have previously been categorized as persistent or dynamic.

  8. HTTP persistent connection - Wikipedia

    en.wikipedia.org/wiki/HTTP_persistent_connection

    Under HTTP 1.0, connections should always be closed by the server after sending the response. [1]Since at least late 1995, [2] developers of popular products (browsers, web servers, etc.) using HTTP/1.0, started to add an unofficial extension (to the protocol) named "keep-alive" in order to allow the reuse of a connection for multiple requests/responses.

  9. Plasmid-mediated resistance - Wikipedia

    en.wikipedia.org/wiki/Plasmid-mediated_resistance

    R-factors are also called a resistance factors or resistance plasmid. They are tiny, circular DNA elements that are self-replicating, that contain antibiotic resistance genes. [ citation needed ] They were first found in Japan in 1959 when it was discovered that some Shigella strains had developed resistance to a number of antibiotics used to ...